Efficient Supervised Image Clustering Based on Density Division and Graph Neural Networks

نویسندگان

چکیده

In recent research, supervised image clustering based on Graph Neural Networks (GNN) connectivity prediction has demonstrated considerable improvements over traditional algorithms. However, existing algorithms are usually time-consuming and limit their applications. order to infer the between instances, they created a subgraph for each instance. Due creation process of large number subgraphs as input GNN, computation overheads enormous. To address high overhead problem in GNN prediction, we present time-efficient effective GNN-based framework density division namely DDC-GNN. DDC-GNN divides all instances into high-density parts low-density parts, only performs resulting significant reduction redundant calculations. We test two typical models module framework, which graph convolutional networks (GCN)-based model auto-encoder (GAE)-based model. Meanwhile, adaptive generated ensure sufficient contextual information extraction instead fixed-size subgraphs. According experiments different datasets, achieves higher accuracy is almost five times quicker than those without strategy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph-based multimodal semi-supervised image classification

We investigate an image classification task where training images come along with tags, but only a subset being labeled, and the goal is to predict the class label of test images without tags. This task is important for image search engine on photo sharing websites. In previous studies, it is handled by first training a multiple kernel learning classifier using both image content and tags to sc...

متن کامل

Efficient Anytime Density-based Clustering

Many clustering algorithms suffer from scalability problems on massive datasets and do not support any user interaction during runtime. To tackle these problems, anytime clustering algorithms are proposed. They produce a fast approximate result which is continuously refined during the further run. Also, they can be stopped or suspended anytime and provide an answer. In this paper, we propose a ...

متن کامل

A Semi-Supervised Clustering Method Based on Graph Contraction and Spectral Graph Theory

Semi-supervised learning is a machine learning framework where learning from data is conducted by utilizing a small amount of labeled data as well as a large amount of unlabeled data (Chapelle et al., 2006). It has been intensively studied in data mining and machine learning communities recently. One of the reasons is that, it can alleviate the time-consuming effort to collect “ground truth” la...

متن کامل

Link Prediction Based on Graph Neural Networks

Traditional methods for link prediction can be categorized into three main types: graph structure feature-based, latent feature-based, and explicit feature-based. Graph structure feature methods leverage some handcrafted node proximity scores, e.g., common neighbors, to estimate the likelihood of links. Latent feature methods rely on factorizing networks’ matrix representations to learn an embe...

متن کامل

Better Learning of Supervised Neural Networks Based on Functional Graph – An Experimental Approach

Multilayered feed forward neural networks possess a number of properties which make them particularly suited to complex problems. Neural networks have been in use in numerous meteorological applications including weather forecasting. As Neural Networks are being more and more widely used in recent years, the need for their more formal definition becomes increasingly apparent. This paper present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2022

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs14153768